Soft constraint abstraction based on semiring homomorphism
نویسندگان
چکیده
منابع مشابه
Soft constraint abstraction based on semiring homomorphism
The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi [3], is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constraints that uses semiring homomorphism. To find optimal solutions of the concrete problem, the idea is, first working in the abstract problem and finding its optimal sol...
متن کاملSemiring-Based Soft Constraints
The semiring-based formalism to model soft constraint has been introduced in 1995 by Ugo Montanari and the authors of this paper. The idea was to make constraint programming more flexible and widely applicable. We also wanted to define the extension via a general formalism, so that all its instances could inherit its properties and be easily compared. Since then, much work has been done to stud...
متن کاملSemiring-based Constraint Logic Programming
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiringbased constraint systems. This allows us to perform in the same language both constraint solving and optimization. In fact, constraint systems based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability, fuzzyness, and optimization. We th...
متن کاملDiagnosis as Semiring-Based Constraint Optimization
Overview Diagnosis traditionally viewed as logical reasoning – (de Kleer and Williams 87), (Reiter 87), ... But more naturally viewed as constraint optimization – Minimal set of faulty components, most likely fault, ... Framework that unifies qualitative and quantitative notions of diagnosis using semiring-based CSP – Choose appropriate semiring and construct constraints Diagnosis algorithms ba...
متن کاملAdaptive Domain Abstraction in a Soft-Constraint Message-Passing Algorithm
The computational tasks of model-based diagnosis and planning in embedded systems can be framed as soft-constraint optimization problems with planning costs or state transition probabilities as preferences. Running constraint optimization in embedded systems requires to reduce complexity, which can be achieved by combining dynamic programming message-passing algorithms with message approximatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.03.029